The Impact of Early Positive Results on a Mathematics and Science Partnership: The Experience of the Institute for Chemistry Literacy Through Computational Science

After one year of implementation, the Institute for Chemistry Literacy through Computational Science, an NSF Mathematics and Science Partnership Institute Project led by the University of Illinois at Urbana-Champaign’s Department of Chemistry, College of Medicine, and National Center for Supercomputing Applications, experienced statistically significant gains in chemistry content knowledge among students of the rural high school teachers participating in its intensive, year-round professional development course, compared to a control group. The project utilizes a two-cohort, delayed-treatment, random control trial, quasi-experimental research design with the second cohort entering treatment one year following the first. The three-year treatment includes intensive two-week summer institutes, occasional school year workshops and year-round, on-line collaborative lesson development, resource sharing, and expert support. The means of student pre-test scores for Cohort I (η=963) and Cohort II (η=862) teachers were not significantly different. The mean gain (difference between pre-test and post-test scores) after seven months in the classroom for Cohort I was 9.8 percentage points, compared to 6.7 percentage points for Cohort II. This statistically significant difference (p\u3c.001) represented an effect size of .25 standard deviation units, and indicated unusually early confirmation of treatment effects. When post-tests were compared, Cohort I students scored significantly higher than Cohort II and supported the gain score differences. The impact of these results on treatment and research plans is discussed. concentrating on the effect of lessening rural teachers’ isolation and increasing access to tools to facilitate learning

Symetric Monopoles

We discuss $SU(2)$ Bogomolny monopoles of arbitrary charge $k$ invariant under various symmetry groups. The analysis is largely in terms of the spectral curves, the rational maps, and the Nahm equations associated with monopoles. We consider monopoles invariant under inversion in a plane, monopoles with cyclic symmetry, and monopoles having the symmetry of a regular solid. We introduce the notion of a strongly centred monopole and show that the space of such monopoles is a geodesic submanifold of the monopole moduli space. By solving Nahm's equations we prove the existence of a tetrahedrally symmetric monopole of charge $3$ and an octahedrally symmetric monopole of charge $4$, and determine their spectral curves. Using the geodesic approximation to analyse the scattering of monopoles with cyclic symmetry, we discover a novel type of non-planar $k$-monopole scattering process

Causality Violations in Cascade Models of Nuclear Collisions

Transport models have successfully described many aspects of intermediate energy heavy-ion collision dynamics. As the energies increase in these models to the ultrarelativistic regime, Lorentz covariance and causality are not strictly respected. The standard argument is that such effects are not important to final results; but they have not been seriously considered at high energies. We point out how and why these happen, how serious of a problem they may be and suggest ways of reducing or eliminating the undesirable effects.Comment: RevTeX, 23 pages, 9 (uuencoded) figures; to appear in Phys. Rev

A Geometric Model for Odd Differential K-theory

Odd $K$-theory has the interesting property that it admits an infinite number of inequivalent differential refinements. In this paper we provide a bundle theoretic model for odd differential $K$-theory using the caloron correspondence and prove that this refinement is unique up to a unique natural isomorphism. We characterise the odd Chern character and its transgression form in terms of a connection and Higgs field and discuss some applications. Our model can be seen as the odd counterpart to the Simons-Sullivan construction of even differential $K$-theory. We use this model to prove a conjecture of Tradler-Wilson-Zeinalian regarding a related differential extension of odd $K$-theoryComment: 36 page

A note on monopole moduli spaces

We discuss the structure of the framed moduli space of Bogomolny monopoles for arbitrary symmetry breaking and extend the definition of its stratification to the case of arbitrary compact Lie groups. We show that each stratum is a union of submanifolds for which we conjecture that the natural $L^2$ metric is hyperKahler. The dimensions of the strata and of these submanifolds are calculated, and it is found that for the latter, the dimension is always a multiple of four.Comment: 17 pages, LaTe

The architecture of a video image processor for the space station

The architecture of a video image processor for space station applications is described. The architecture was derived from a study of the requirements of algorithms that are necessary to produce the desired functionality of many of these applications. Architectural options were selected based on a simulation of the execution of these algorithms on various architectural organizations. A great deal of emphasis was placed on the ability of the system to evolve and grow over the lifetime of the space station. The result is a hierarchical parallel architecture that is characterized by high level language programmability, modularity, extensibility and can meet the required performance goals

How pairs of partners emerge in an initially fully connected society

A social group is represented by a graph, where each pair of nodes is connected by two oppositely directed links. At the beginning, a given amount $p(i)$ of resources is assigned randomly to each node $i$. Also, each link $r(i,j)$ is initially represented by a random positive value, which means the percentage of resources of node $i$ which is offered to node $j$. Initially then, the graph is fully connected, i.e. all non-diagonal matrix elements $r(i,j)$ are different from zero. During the simulation, the amounts of resources $p(i)$ change according to the balance equation. Also, nodes reorganise their activity with time, going to give more resources to those which give them more. This is the rule of varying the coefficients $r(i,j)$. The result is that after some transient time, only some pairs $(m,n)$ of nodes survive with non-zero $p(m)$ and $p(n)$, each pair with symmetric and positive $r(m,n)=r(n,m)$. Other coefficients $r(m,i\ne n)$ vanish. Unpaired nodes remain with no resources, i.e. their $p(i)=0$, and they cease to be active, as they have nothing to offer. The percentage of survivors (i.e. those with with $p(i)$ positive) increases with the velocity of varying the numbers $r(i,j)$, and it slightly decreases with the size of the group. The picture and the results can be interpreted as a description of a social algorithm leading to marriages.Comment: 7 pages, 3 figure